k zim://A/ _k_.html

  k 

  

 

k 




  
,
"  ",   " "        
.


   ,        

 ,     

n 


   -  

        
-  .

k


   ,k 
.       

 

  


 

G 


     .  E -V      

  -  .j -i   

  -

S 


 V 

k 


   (- )    

,    .

  

 

k 


   

NP 


          

k 


       

  

Dom inating s et)


)  

[1]
. 

     . 

1985 


          

 

[2]2 

   

S 


  -

k 


 .       

 -

S


.  ,          -

S 


  - 

.S 


      (

.O(kn 


              (

Maxim al 


independent s et


) 

k 


      

G 


  , 

G 


 (

Power 


Graphs 


)           

[3]k 

  


A pproximation algorithms, Vijay Vazirani ..1


, 

47-48 


.2


. 


,         

2 


    

. 

Dorit S. Hochbaum & David B. Shmoys, A unif ied approach to approximation algorithms f or . .3 


bottleneck problems, Jour nal of the ACM (JACM ), 1986


 .( Volume 33 , Issue 3 (July 1986 

This article is is s ued from (http://he.wikipedia.org/wiki/%D7%91%D7%A2%D7%99 

1 of 2 15/01/2019 11:47 



k zim://A/ _k_.html

%D7%99%D7%AA_k_%D7%94%D7%9E%D7%A8%D7%9B%D7%96%D7%99 
%D7%9D?oldid=16546079) - vers ion of the Thurs day, January 01, 1970. The text is available 
under the Creative Com m ons Attribution/Share Alike (http://creativecom m ons .org/licens es /by-s a 
/3.0/) but additional term s m ay apply for the m edia files . 

2 of 2 15/01/2019 11:47 



